An improved particle swarm optimization algorithm with adaptive weighted delay velocity
نویسندگان
چکیده
منابع مشابه
An Improved Adaptive Dynamic Particle Swarm Optimization Algorithm
In order to overcome the weakness that particle swarm optimization algorithm is likely to fall into local minimum when the complex optimization problems are solved, a new adaptive dynamic particle swarm optimization algorithm is proposed. The paper introduces the evaluation index of particle swarm premature convergence to judge the state of particle swarm in the population space, for the sake o...
متن کاملAn Improved Probability Particle Swarm Optimization Algorithm
This paper deals with the problem of unconstrained optimization. An improved probability particle swarm optimization algorithm is proposed. Firstly, two normal distributions are used to describe the distributions of particle positions, respectively. One is the normal distribution with the global best position as mean value and the difference between the current fitness and the global best fitne...
متن کاملAn Improved Particle Swarm Optimization with an Adaptive Updating Mechanism
Premature convergence when solving multimodal problems is still the main limitation which affects the performance of the PSO. To avoid of premature, an improved PSO algorithm with an adaptive updating mechanism (IPSO) is proposed in this paper. When the algorithm converges to a local optimum, the updating mechanism begins to work so that the stagnated algorithm obtains energy for optimization. ...
متن کاملAdaptive particularly tunable fuzzy particle swarm optimization algorithm
Particle Swarm Optimization (PSO) is a metaheuristic optimization algorithm that owes much of its allure to its simplicity and its high effectiveness in solving sophisticated optimization problems. However, since the performance of the standard PSO is prone to being trapped in local extrema, abundant variants of PSO have been proposed by far. For instance, Fuzzy Adaptive PSO (FAPSO) algorithms ...
متن کاملAn improved quantum-behaved particle swarm optimization algorithm with weighted mean best position
Keywords: PSO QPSO Mean best position Weight parameter WQPSO a b s t r a c t Quantum-behaved particle swarm optimization (QPSO) algorithm is a global convergence guaranteed algorithms, which outperforms original PSO in search ability but has fewer parameters to control. In this paper, we propose an improved quantum-behaved particle swarm optimization with weighted mean best position according t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems Science & Control Engineering
سال: 2021
ISSN: 2164-2583
DOI: 10.1080/21642583.2021.1891153